Storage efficient decoding for a class of binary be Bruijn sequences
نویسندگان
چکیده
منابع مشابه
De Bruijn Sequences for the Binary Strings with Maximum Density
A de Bruijn sequence is a circular binary string of length 2n that contains each binary string of length n exactly once as a substring. A maximum-density de Bruijn sequence is a circular binary string of length ( n
متن کاملDe Bruijn Sequences for Fixed-Weight Binary Strings
De Bruijn sequences are circular strings of length 2n whose length n substrings are the binary strings of length n. Our focus is on creating circular strings of length (
متن کاملGenerating De Bruijn Sequences: An Efficient Implementation
This paper presents a concise and efficient implementation of a method of producing De Bruijn sequences. The implementation is based on a recursive method due to Lempel [5]. We provide code for a function that for each pair of integers n ≥ 2 and 0 £ x < 2 returns a unique De Bruijn sequence of order-n. The implementation requires only O(2 n ) bit operations
متن کاملCorrelation of Pseudorandom Binary Sequences from de Bruijn Graphs
Binary sequences with good correlation properties play an important role in many secure communication systems and testing of systems. In this paper, we describe and illustrate sets of pseudorandom sequences from de Bruijn graphs which have good correlation functions and critically analyze how we investigate all homomorphisms that give low correlation values between the binary sequences. We comp...
متن کاملLarge Order Binary de Bruijn Sequences via Zech's Logarithms
This work shows how to efficiently construct binary de Bruijn sequences, even those with large orders, using the cycle joining method. The cycles are generated by an LFSR with a chosen period e whose irreducible characteristic polynomial can be derived from any primitive polynomial of degree n satisfying e = 2 n −1 t by t-decimation. The crux is our proof that determining Zech’s logarithms is e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1995
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)00215-5